Program Algebras with Monotone Floyd-Hoare Composition
نویسندگان
چکیده
In the paper special program algebras of partial predicates and functions are described. Such algebras form a semantic component of a modified Floyd-Hoare logic constructed on the base of a composition-nominative approach. According to this approach, Floyd-Hoare assertions are presented with the help of a special composition called Floyd-Hoare composition. Monotonicity and continuity of this composition are proved. The language of the modified Floyd-Hoare logic is described. Further, the inference rules for such logic are studied, their soundness conditions are specified. The logic constructed can be used for program verification.
منابع مشابه
Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
We derive a Floyd-Hoare logic for non-local jumps and mutable higher-order procedural variables from a formulæ-as-types notion of control for classical logic. A key contribution of this work is the design of an imperative dependent type system for Hoare triples, which corresponds to classical logic, but where the famous consequence rule is admissible. Moreover, we prove that this system is comp...
متن کاملAn Approach To Formalization of an Extension of Floyd-Hoare Logic
The classical Floyd-Hoare logic is defined for the case of total preand postconditions and partial programs (i.e. programs can be undefined on some input data, but conditions must be defined on all data). In this paper we propose an extension of this logic for the case of partial conditions and partial programs on hierarchically organized data. These data are based on the naming relation and ar...
متن کاملWeak Second Order Characterizations of Various Program Verification Systems
We show the equivalence (!{ LeivIIlII' .1' dUlfl/r;wr;zmion of Floyd-Hoare Logic in weak second order logic (fLeSSJ) with both Csirltl(lZ'S (f Cs80I) 111/(/ Selin's (f Sa85bJ) characterizations of Floyd-Hoare logic in Nonstandard Logics of Programs, Ow method allows us u) spell out tlJ.e precise role of the comprehension axiom in weak second order [og;I:. Ii .(~ then prove similar resultsIor ot...
متن کاملHypothesis Elimination in Kleene Semirings
—A Kleene Semiring (KS) is an algebraic structure satisfying the axioms of Kleene algebra, minus the annihilation axioms x.0 = 0 = 0.x. We show that, like Kleene algebra (KA), KS admits efficient elimination of various kinds of equational hypotheses, in particular Hoare formulas (x = 0). Our method is purely proof-theoretic, and can be used to eliminate Horn hypotheses in any suitable Horn-equa...
متن کاملKleene Algebras with Domain
Kleene algebras with domain are Kleene algebras endowed with an operation that maps each element of the algebra to its domain of definition (or its complement) in abstract fashion. They form a simple algebraic basis for Hoare logics, dynamic logics or predicate transformer semantics. We formalise a modular hierarchy of algebras with domain and antidomain (domain complement) operations in Isabel...
متن کامل